479B - Towers - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define HareKrishna ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define ll long long int
#define pb push_back
const ll N=1e8+5;

void rk_d(){
 ll n,m;
 cin>>n>>m;
 
 vector<pair<ll,ll>> v;
 ll i,j;
 
 for (i=0; i<n; i++){
    ll x;
    cin>>x;
    v.pb({x,i+1});
 }
 
 vector<pair<ll,ll>> ans;
 
 for (i=0; i<m; i++){
    sort(v.rbegin(),v.rend());
    
    if (v[0].first==v[n-1].first){
       break;
    }
    
    v[0].first-=1;
    v[n-1].first+=1;
    ans.pb({v[0].second,v[n-1].second});
    
 }
 
 sort(v.rbegin(),v.rend());
 
 ll curr=v[0].first-v[n-1].first;

 cout<<curr<<" "<<ans.size()<<endl;
 for (auto it: ans){
    cout<<it.first<<" "<<it.second<<endl;
 }
}
 
int main(){
	
   HareKrishna;
   ll t;
   //cin>>t;
   t=1;
   
   while (t--){
   	
   	rk_d();
   	
   }
   
   return 0;
}